Embedding hypercubes into pancake, cycle prefix and substring reversal networks

نویسندگان

  • Linda Gardner
  • Zevi Miller
  • Dan Pritikin
  • Ivan Hal Sudborough
چکیده

Among Cayley graphs on the symmetric group, some that have noticeably low diameter relative to the number of generators involved are the pancake network, burnt pancake network, and cycle prefix network [1,6,7,8]. Another such Cayley graph is the star network, and constructions have been given for one-to-one and one-tomany low dilation embeddings of hypercubes into star networks [11,12,15]. For each of dilations 1 through 4, in this paper we construct embeddings of hypercube (and hypercube-like) networks into pancake, burnt pancake, cycle prefix, and substring reversal networks. Embeddings of hypercubes into pancake networks is our focus, the other results being closely related.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Spectral Gap of Graphs Arising From Substring Reversals

The substring reversal graph Rn is the graph whose vertices are the permutations Sn, and where two permutations are adjacent if one is obtained from a substring reversal of the other. We determine the spectral gap of Rn, and show that its spectrum contains many integer values. Further we consider a family of graphs that generalize the prefix reversal (or pancake flipping) graph, and show that e...

متن کامل

Comparing Star and Pancake Networks

Low dilation embeddings are used to compare similarities between star and pancake networks. The pancake network of dimension n, Pn, has n! nodes, one for each permutation, and an undirected edge between permutations (nodes) when some prefix reversal transforms one permutation into the other. The star network of dimension n, Sn, has n! nodes, one for each permutation, and an undirected edge betw...

متن کامل

Independent Even Cycles in the Pancake Graph and Greedy Prefix-Reversal Gray Codes

Any `–cycle, 6 6 `6 n!, can be embedded in the Pancake graph Pn, n > 3. In this paper we prove the existence of a family of maximal sets of even independent cycles with length bounded by O(n2). We introduce the new concept of Prefix– reversal Gray codes based on the independent cycles which extends the known greedy Prefix–reversal Gray code constructions considered by Zaks and Williams. We deri...

متن کامل

Embedding of Meshes on Rotator Graphs

PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL Abstract { A set of directed permutation graphs called rotator graphs were proposed as an alternative to the star and pancake graphs for multiprocessor interconnection networks. The rotator graphs have a smaller diameter than star and pancake graphs for the same number of nodes, while sharing the...

متن کامل

Cycle embedding in pancake interconnection networks

The ring structure is important for distributed computing, and it is useful to construct a hamiltonian cycle or rings of various length in the network. Kanevsky and Feng [3] proved that all cycles of length l where 6 ≤ l ≤ n!−2 or l = n! can be embedded in the pancake graphs Gn. Later, Senoussi and Lavault [9] presented the embedding of ring of length l, 3 ≤ l ≤ n!, with dilation 2 in the panca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995